Scheduling Simulations: An Experimental Approach to Time-Sharing Multiprocessor Scheduling Schemes
نویسندگان
چکیده
منابع مشابه
Scheduling Simulations: An Experimental Approach to Time-Sharing Multiprocessor Scheduling Schemes
Real time systems that are logically programmed for scientific applications involve frequent job arrivals, thus requires a parallel architecture, so that maximum applications can be executed simultaneously resulting in less waiting time and maximum resource utilization. This must be achieved by workload partitioning & characterization, directs towards the development of Multiprocessor machines,...
متن کاملAn Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor
An optimal solution to the problem of scheduling real-time tasks on a set of identical processors is derived. The described approach is based on solving an equivalent uniprocessor real-time scheduling problem. Although there are other scheduling algorithms that achieve optimality, they usually impose prohibitive preemption costs. Unlike these algorithms, it is observed through simulation that t...
متن کاملHybrid Multiprocessor Real-Time Scheduling Approach
Real-time scheduling is one of the most important aspects of a real-time system design. To achieve a real-time system’s requirement, especially to be fast, multiprocessor systems are used. Generally, multiprocessor real-time scheduling algorithms fall into one the two well-known approaches: Partitioning or Global. The partitioning approach has acceptable overhead for underlying system but can N...
متن کاملReal-Time Scheduling Models: an Experimental Approach
Classical real-time scheduling models, as those commonly referred in literature, tend to ignore the impact of system tasks upon the timeliness of application tasks. However, as this paper testifies, this overhead is not negligible even for very simple systems. Accurate scheduling models from where control engineers can confidently design their real-time applications are thus required. In this p...
متن کاملAn Optimal Multiprocessor Real-Time Scheduling Algorithm
An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisses certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of processors and upper bounds on the number of preemptions in a given time interval and for any single t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/10512-5476